Localized solutions in Waring's problem: the lower bound

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bound for the Unique Games Problem

We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a function of the probabilities. Finding probabilities that maximize this expected value is shown to be equivalent to obtaining an optimal solution to the unique game...

متن کامل

The Cramer-Rao Lower Bound in the Phase Retrieval Problem

This paper presents an analysis of Cramer-Rao lower bounds (CRLB) in the phase retrieval problem. Previous papers derived Fisher Information Matrices for the phaseless reconstruction setup. Two estimation setups are presented. In the first setup the global phase of the unknown signal is determined by a correlation condition with a fixed reference signal. In the second setup an oracle provides t...

متن کامل

A Lower Bound for Heilbronn's Problem

We disprove Heilbronn's conjecture—that N points lying in the unit disc necessarily contain a triangle of area less than c/N. Introduction We think that the best account of the problem can be achieved by simply copying the corresponding paragraphs from Roth's paper [6]. "Let Pv, P2,..., Pn (where n ^ 3) be a distribution of n points in a (closed) disc of unit area, such that the minimum of the ...

متن کامل

Exact quantum lower bound for grover's problem

One of the most important quantum algorithms ever discovered is Grover’s algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover’s algorithm is exactly optimal. Similar to existing methods for proving lower bounds, we bound the amount of information we can gain from a single oracle query, but we bound this information in terms of angles. T...

متن کامل

Resolution of the uniform lower bound problem in constructive analysis

In a previous paper we constructed a full and faithful functor M from the category of locally compact metric spaces to the category of formal topologies (representations of locales). Here we show that for a real-valued continuous function f , M ( f ) factors through the localic positive reals if, and only if, f has a uniform positive lower bound on each ball in the locally compact space. We wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2010

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa142-2-3